Diffusive search with spatially dependent resetting

We consider a stochastic search model with resetting for an unknown stationary target $a\in \mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is also armed with an exponential clock with spatially dependent rate $r=r\left(\cdot \right)$, so that if it has failed to locate the target by the time the clock rings, then its position is reset to the origin and it continues its search anew from there. Denote the position of the searcher at time $t$ by $X\left(t\right)$. Let $E_0^{\left(r\right)}$ denote expectations for the process $X\left(\cdot \right)$. The search ends at time $T_a=inf\{t\ge 0:X\left(t\right)=a\}$. The expected time of the search is then ${\int }_{\mathbb{R}}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. Ideally, one would like to minimize this over all resetting rates $r$. We obtain quantitative growth rates for $E_0^{\left(r\right)}{T}_a$ as a function of $a$ in terms of the asymptotic behavior of the rate function $r$, and also a rather precise dichotomy on the asymptotic behavior of the resetting function $r$ to determine whether $E_0^{\left(r\right)}{T}_a$ is finite or infinite. We show generically that if $r\left(x\right)$ is of the order ${\left|x\right|}^{2l}$, with $l>-1$, then $log{E}_0^{\left(r\right)}{T}_a$ is of the order ${\left|a\right|}^{l+1}$; in particular, the smaller the asymptotic size of $r$, the smaller the asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$. The asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$ continues to decrease when $r\left(x\right)\sim \frac{D\lambda }{x^2}$ with $\lambda >1$; now the growth rate of $E_0^{\left(r\right)}{T}_a$ is more or less of the order ${\left|a\right|}^{\frac{1+\sqrt{1+8\lambda }}{2}}$. Note that this exponent increases to $\infty$ when $\lambda$ increases to $\infty$ and decreases to 2 when $\lambda$ decreases to 1. However, if $\lambda =1$, then $E_0^{\left(r\right)}{T}_a=\infty$, for $a\ne 0$. Our results suggest that for many distributions $\mu$ supported on all of $\mathbb{R}$, a near optimal (or optimal) choice of resetting function $r$ in order to minimize ${\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$ will be one which decays quadratically as $\frac{D\lambda }{x^2}$ for some $\lambda >1$. We also give explicit, albeit rather complicated, variational formulas for ${inf}_{r\gneqq 0}{\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. For distributions $\mu$ with compact support, one should set $r=\infty$ off of the support. We also discuss this case.     

Existence of multiple and sign-changing solutions for a second-order nonlinear functional difference equation with periodic coefficients

In the present paper, we apply the method of invariant sets of descending flow to establish a series of criteria to ensure that a second-order nonlinear functional difference equation with periodic boundary conditions possesses at least one trivial solution and three nontrivial solutions. These nontrivial solutions consist of sign-changing solutions, positive solutions and negative solutions. Moreover, as an application of our theoretical results, an example is elaborated. Our results generalize and improve some existing ones.     

Compressibility of random walker trajectories on growing networks

We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible.     

基于计算机视觉技术的茶叶品质随机森林感官评价方法研究

为弥补茶叶品质感官审评存在的缺陷，利用计算机视觉技术对茶叶品质进行快速无损评价研究。以碧螺春绿茶为对象，依据专家感官审评结果，将茶样分成4个等级；采用中值滤波及拉普拉斯算子对茶样图像进行预处理，并提取预处理后的茶样图像的颜色特征和纹理特征以表征茶叶图像的外形特征，利用随机森林算法对茶叶外形特征属性进行重要性排序；筛选出重要性较大的特征及随机森林算法中最优的决策树棵数建立感官评价模型，并与建立的支持向量机(SVM)模型性能相比较。结果表明：色调均值、色调标准差、绿体均值、平均灰度级、饱和度均值、红体均值、饱和度标准差、亮度均值、一致性等9个特征属性的重要性较大，且与感官审评特征描述结果相一致；当采用优选出的9个重要性较大的特征及决策数棵数为500时，建立的模型性能最优，模型总体判别率为95.75%，Kappa系数为0.933，OOB误差为5%，较SVM模型分别提高了3.5%，0.066，优选的9个重要性较大的图像特征与感官审评特征描述相一致。研究表明：利用随机森林方法筛选出对茶叶外形特征属性贡献最大的少数几个特征建立模型，模型性能就能达到很好的识别效果，模型得到简化，同时模型精度和稳定性都高于其他方法。     

The Bertini irreducibility theorem for higher codimensional slices

In [3], Poonen and Slavov recently developed a novel approach to Bertini irreducibility theorems over an arbitrary field, based on random hyperplane slicing. In this paper, we extend their work by proving an analogous bound for the dimension of the exceptional locus in the setting of linear subspaces of higher codimensions.     

Collective risk models with dependence

In actuarial science, collective risk models, in which the aggregate claim amount of a portfolio is defined in terms of random sums, play a crucial role. In these models, it is common to assume that the number of claims and their amounts are independent, even if this might not always be the case. We consider collective risk models with different dependence structures. Due to the importance of such risk models in an actuarial setting, we first investigate a collective risk model with dependence involving the family of multivariate mixed Erlang distributions. Other models based on mixtures involving bivariate and multivariate copulas in a more general setting are then presented. These different structures allow to link the number of claims to each claim amount, and to quantify the aggregate claim loss. Then, we use Archimedean and hierarchical Archimedean copulas in collective risk models, to model the dependence between the claim number random variable and the claim amount random variables involved in the random sum. Such dependence structures allow us to derive a computational methodology for the assessment of the aggregate claim amount. While being very flexible, this methodology is easy to implement, and can easily fit more complicated hierarchical structures.